Kullback-Leibler divergence and Markov random fields for speckled image restoration
نویسندگان
چکیده
In this paper we describe an approximation of speckled image observation (attachment to data) laws by generalized gaussian pdfs. We use Kullback-Leibler (KL) divergence (entropy) for this purpose. This leads to a mathematical model which can be useful for speckled image restoration and for related hyperparamater estimation.
منابع مشابه
On the uniqueness of the solution of image reconstruction problems with Poisson data
This paper is concerned with the uniqueness of the Maximum a Posteriori estimate for restoration problems of data corrupted by Poisson noise, when we have to minimize a combination of the generalized Kullback–Leibler divergence and a regularization penalty function. The aim of this paper is to prove the uniqueness result for 2D and 3D problems for several penalty functions, such as an edge pres...
متن کاملModel Confidence Set Based on Kullback-Leibler Divergence Distance
Consider the problem of estimating true density, h(.) based upon a random sample X1,…, Xn. In general, h(.)is approximated using an appropriate in some sense, see below) model fƟ(x). This article using Vuong's (1989) test along with a collection of k(> 2) non-nested models constructs a set of appropriate models, say model confidence set, for unknown model h(.).Application of such confide...
متن کاملNorges Teknisk-naturvitenskapelige Universitet Fitting Gaussian Markov Random Fields to Gaussian Fields Fitting Gaussian Markov Random Fields to Gaussian Fields Tmr Project on Spatial Statistics (erb-fmrx-ct960095) for Support and Inspiration
SUMMARY This paper discusses the following task often encountered building Bayesian spatial models: construct a homogeneous Gaussian Markov random field (GMRF) on a lattice with correlation properties either as present in observed data or consistent with prior knowledge. The Markov property is essential in design of computational efficient Markov chain Monte Carlo algorithms used to analyse suc...
متن کاملExploiting the Limits of Structure Learning via Inherent Symmetry
This theoretical paper is concerned with the structure learning limit for Gaussian Markov random fields from i.i.d. samples. The common strategy is applying the Fano method to a family of restricted ensembles. The efficiency of this method, however, depends crucially on selected restricted ensembles. To break through this limitation, we analyze the whole graph ensemble from a group theoretical ...
متن کاملChange detection in synthetic aperture radar images with a sliding hidden Markov chain model
This work deals with unsupervised change detection in bi-date Synthetic Aperture Radar (SAR) images. Whatever the indicator of change used to compute the criterion image, e.g. log-ratio or Kullback-Leibler divergence between images, we have observed poor quality change maps for some events when using the Hidden Markov Chain (HMC) model we focus on in this work. The main reason comes from the st...
متن کامل